The Maximum Travelling Salesman Problem on symmetric Demidenko matrices
نویسندگان
چکیده
منابع مشابه
On Random Symmetric Travelling Salesman Problems
Let the edges of the complete graph Kn be assigned independent uniform [0; 1] random edge weights. Let ZTSP and Z2FAC be the weights of the minimum length travelling salesman tour and minimum weight 2-factor respectively. We show that whp jZTSP Z2FAC j = o(1). The proof is via by the analysis of a polynomial time algorithm that nds a tour only a little longer than Z2FAC .
متن کاملA Survey on Travelling Salesman Problem
The Travelling Salesman problem is one of the most popular problems from the NP set, it is also one of the hardest too. The solution to this problem enjoys wide applicability in a variety of practical fields. Thus it highly raises the need for an efficient solution for this NP Hard problem. However even the most common deterministic solutions to the problem are known to possess an exponential t...
متن کاملThe multi-stripe travelling salesman problem
In the classical Travelling Salesman Problem (TSP), the objective function sums the costs for travelling from one city to the next city along the tour. In the q-stripe TSP with [Formula: see text], the objective function sums the costs for travelling from one city to each of the next q cities in the tour. The resulting q-stripe TSP generalizes the TSP and forms a special case of the quadratic a...
متن کاملAnt colonies for the travelling salesman problem.
We describe an artificial ant colony capable of solving the travelling salesman problem (TSP). Ants of the artificial colony are able to generate successively shorter feasible tours by using information accumulated in the form of a pheromone trail deposited on the edges of the TSP graph. Computer simulations demonstrate that the artificial ant colony is capable of generating good solutions to b...
متن کاملOn the x-and-y-axes travelling salesman problem
This paper deals with a special case of the Euclidean Travelling Salesman Problem known as the x-and-y-axes TSP. In this special case, all cities are situated on the x-axis and on the y-axis of an orthogonal coordinate system for the Euclidean plane. We show that the problem can be solved in O(n) time.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2000
ISSN: 0166-218X
DOI: 10.1016/s0166-218x(99)00148-1